Computing discrete logarithm by interval-valued paradigm
نویسندگان
چکیده
منابع مشابه
Computing discrete logarithm by interval-valued paradigm
Interval-valued computing is a relatively new computing paradigm. It uses finitely many interval segments over the unit interval in a computation as data structure. The satisfiability of Quantified Boolean formulae and other hard problems, like integer factorization, can be solved in an effective way by its massive parallelism. The discrete logarithm problem plays an important role in practice,...
متن کاملDiscrete Interval–valued Choquet Integrals
For a fixed finite universe U = {u1, . . . , un}, a fuzzy subset F of U is given by its membership function F : U → [0, 1] (we will not distinguish fuzzy subsets and the corresponding membership functions notations). For several practical purposes, especially in multicriteria decision making, the expected value E(F ) of F should be introduced. The original Zadeh approach in [11] was based on a ...
متن کاملInterval-valued Fuzzy Sets in Soft Computing
In this work, we explain the reasons for which, for some specific problems, interval-valued fuzzy sets must be considered a basic component of Soft Computing.
متن کاملKangaroo Methods for Solving the Interval Discrete Logarithm Problem
The interval discrete logarithm problem is defined as follows: Given some g, h in a group G, and some N ∈ N such that gz = h for some z where 0 ≤ z < N , find z. At the moment, kangaroo methods are the best low memory algorithm to solve the interval discrete logarithm problem. The fastest non parallelised kangaroo methods to solve this problem are the three kangaroo method, and the four kangaro...
متن کاملComputing a Discrete Logarithm in O(n^3)
This paper presents a means with time complexity of at worst O(n) to compute the discrete logarithm on cyclic finite groups of integers modulo p. The algorithm makes use of reduction of the problem to that of finding the concurrent zeros of two periodic functions in the real numbers. The problem is treated as an analog to a form of analog rotor code computed cipher. The computation of a Discret...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2014
ISSN: 2075-2180
DOI: 10.4204/eptcs.143.7